Continuity and Bisimulations

نویسنده

  • J. M. Davoren
چکیده

The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular signiicance in work on the formal analysis and veriication of hybrid control systems, where system properties are ex-pressible by formulas of the modal-calculus or weaker temporal logics. Our purpose here is to give an analysis of the concept of bisimulation, starting with the observation that the zigzag conditions are suggestive of some form of continuity. We give a topological characterization of bisimularity for preorders, and then use the topology as a route to examining the algebraic semantics for the-calculus, developed in recent work of Kwiatkowska et al, and its relation to the standard set-theoretic semantics. In our setting,-calculus sentences evaluate as clopen sets of an Alexandroo topology, rather than as clopens of a (compact, Haus-dorr) Stone topology, as arises in the Stone space representation of Boolean algebras (with operators). The paper concludes by applying the topological characterization to obtain the decidability of-calculus properties for a class of rst-order deenable hybrid dynamical systems, slightly extending and considerably simplifying the proof of a recent result of Laaerriere et al. R esum e. La notion d'une relation de bisimulation est d'importance fondamental dans beaucoup de secteurs de th eorie de calcul, et de logique. R ecemment, elle est venue pour prendre une signiication par-ticuli ere dans le travail sur l'analyse et la v eriication formelles des syst emes de contr^ ole hybrides, o u les propri et es de syst eme sont ex-primables par des formules du-calcul modal ou des logiques tem-porelles plus faibles. Notre but est de donner une analyse du concept du bisimulation, commenn cant par l'observation que les conditions de zigzag sont suggestifs d'une certaine forme de continuit e. Nous donnons une caract erisation topologique de bisimularity pour des preorders, et puis employons la topologie pour examiner la s emantique alg ebrique du-calcul, d evelopp ee dans les travaux r ecents de Kwiatkowska et autres, et sa relation la s emantique de la theorie des ensembles standard. Dans notre arrangement, les phrases du-calcul evaluent comme des ensembles clopen d'une topologie d'Alexandro, plutt que des clopens d'une topologie de Stone (contrat, Hausdorr), comme surgit dans la repr esentation dans un espace de Stone des alg ebres bool eennes avec des op erateurs. Le papier conclut en appliquant la caract erisation topologique pour obtenir la …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distribution-Based Bisimulation for Labelled Markov Processes

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribu...

متن کامل

Topologies, continuity and bisimulations

-The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, based on the modal //-calculus. Our purpose here is to give an analysis of the concept, starting with the observation that the zig-zag conditions are suggesti...

متن کامل

A Calculus for True Concurrency

We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...

متن کامل

Sound Bisimulations for Higher-Order Distributed Process Calculus

While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...

متن کامل

Functional Bisimulations

Functional Bisimulations constitute a unifying framework for the equivalence of operational semantics and the correctness of implementations on an abstract machine. In the deterministic setting, functional bisimula-tions are in one-to-one correspondence to partial Lagois Connections with lower sets as domains of deenition. Unlike as for relational bisimulations in concurrency, functional bisimu...

متن کامل

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distributions functors with the multiset functor by means of adequate natural transformations. This leads us to the general topic that we investigate in the pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998